منابع مشابه
Observational structures and their logic *
Astesiano, E., A. Giovini and G. Reggio, Observational structures and their logic, Theoretical Computer Science 96 (1992) 247-283. A powerful paradigm is presented for defining semantics of data types which can assign sensible semantics also to data representing processes. Processes are abstractly viewed as elements of observable sort in an algebraic structure, independently of the language use...
متن کاملObservational logic, constructor-based logic, and their duality
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper we first reconsider the observational logic institution which provides a logical framework f...
متن کاملObservational Logic
We present an institution of observational logic suited for state-based systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the given observers. In parti...
متن کاملConstructor-based observational logic
This paper focuses on the integration of reachability and observability concepts within an algebraic, institution-based framework. In the first part of this work, we develop the essential ingredients that are needed to define the constructorbased observational logic institution, called COL, which takes into account both the generationand observation-oriented aspects of software systems. The und...
متن کاملLogic and Random Structures
We begin with a rather easy random model which illustrates many of the concepts we shall deal with. We call it the simple unary predicate with parameters n, p and denote it by SU(n, p). The model is over a universe Ω of size n, a positive integer. We imagine each x ∈ Ω flipping a coin to decide if U(x) holds, and the coin comes up heads with probability p. Here we have p real, 0 ≤ p ≤ 1. Formal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90186-j